Methods and apparatuses for convolutive blind source separation

ABSTRACT

Methods and apparatuses for convolutive blind source separation are described. Each of a plurality of input signals is transformed into frequency domain. Values of coefficients of unmixing filter corresponding to frequency bins are calculated by performing a gradient descent process on a cost function at least dependent on the coefficients of the unmixing filters. In each iteration of the gradient descent process, gradient terms for calculating the values of the same coefficient of the unmixing filters are adjusted to improve smoothness of gradient terms across the frequency bins. With respect to each of the frequency bins, source signals are estimated by filtering the transformed input signals through the respective unmixing filter configured with the calculated values of the coefficients. The estimated source signals on the respective frequency bins are transformed into time domain. The cost function is adapted to evaluate decorrelation between the estimated source signals.

CROSS REFERENCE TO RELATED APPLICATIONS

This Application claims the benefit of priority to related, co-pending Chinese Patent Application number 201110226040.4 filed on 29 Jul. 2011 and U.S. Patent Application No. 61/540,344 filed on 28 Sep. 2011 entitled “Methods and Apparatuses for Convolutive Blind Source Separation” by Sun, Xuejing hereby incorporated by reference in its entirety.

TECHNICAL FIELD

The present invention relates generally to audio signal processing. More specifically, embodiments of the present invention relate to methods and apparatuses for convolutive blind source separation.

BACKGROUND

In various real-world applications, a convolutive mixing model is usually used to approximate the relationships between the original source signals and the mixed signals captured by the sensors such as microphones. A linear convolution can be approximated by a circular convolution if the frame size of the discrete Fourier transform (DFT) is much larger than the channel length. Then a convolutive mixing process can be represented as multiplication in the frequency domain

Y(ω,t)=W(ω,t)X(ω,t)   (1)

where Y(ω,t) represents the estimated sources [Y₁(ω,t), . . . , Y_(N)(ω,t)]^(T), X(ω, t) is the microphone signals [X₁(ω,t), . . . , X_(N)(ω,t)]^(T), and W(ω,t) (also called as unmixing filter for frequency bin ω) denotes the unmixing matrix including unmixing filter coefficients.

For example, in a two-input-two-output (TITO) case, by assuming a unit gain for direct channels, the unmixing matrix can be represented as

$\begin{matrix} {{W\left( {\omega,t} \right)} = \begin{bmatrix} 1 & {W_{12}\left( {\omega,t} \right)} \\ {W_{21}\left( {\omega,t} \right)} & 1 \end{bmatrix}} & (2) \end{matrix}$

Then the separated signals can be represented as

Y ₁(ω,t)=X ₁(ω,t)+W ₁₂(ω,t)X ₂(ω,t)   (3)

Y ₂(ω,t)=X ₂(ω,t)+W ₂₁(ω,t)X ₁(ω,t)   (4)

Various approaches have been proposed to estimate the unmixing filters. One class of algorithms obtain separation based on second order statistics (SOS) by requiring only non-correlated sources rather than the stronger condition of independence. By exploring additional constraints such as non-stationarity, sufficient conditions for separation can be achieved for SOS systems. One SOS-based approach is the so-called adaptive decorrelation filter (ADF) formulation, which is based on the classical adaptive noise cancellation (ANC) scheme. (See E. Weinstein, M. Feder, and A. V. Oppenheim, “Multi-channel signal separation by decorrelation,” IEEE Trans. Speech Audio Processing, vol. 1, pp. 405-413, April 1993) Other SOS-based approaches have also been proposed, where a cost function for evaluating the decorrelation between separated signals is defined, and values of coefficients of unmixing filters are calculated adaptively by performing a gradient descent process on the cost function. (See Parra L., Spence C., “Convolutive blind source separation of non-stationary sources”, IEEE Trans. on Speech and Audio Processing pp. 320-327, May 2000.)

SUMMARY

According to an embodiment of the present invention, a method of performing convolutive blind source separation is provided. Each of a plurality of input signals is transformed into frequency domain. Values of coefficients of unmixing filters corresponding to frequency bins are calculated by performing a gradient descent process on a cost function at least dependent on the coefficients of the unmixing filters. In each iteration of the gradient descent process, gradient terms for calculating the values of the same coefficient of the unmixing filters are adjusted to improve smoothness of the gradient terms across the frequency bins. With respect to each of the frequency bins, source signals are estimated by filtering the transformed input signals through the respective unmixing filter configured with the calculated values of the coefficients. The estimated source signals on the respective frequency bins are transformed into time domain. The cost function is adapted to evaluate decorrelation between the estimated source signals.

According to an embodiment of the present invention, an apparatus for performing convolutive blind source separation is provided. The apparatus includes a first transformer, a calculator, an estimator and a second transformer. The first transformer transforms each of a plurality of input signals into frequency domain. The calculator calculates values of coefficients of unmixing filters corresponding to frequency bins by performing a gradient descent process on a cost function at least dependent on the coefficients of the unmixing filters. In each iteration of the gradient descent process, gradient terms for calculating the values of the same coefficient of the unmixing filter are adjusted to improve smoothness of the gradient terms across the frequency bins. With respect to each of the frequency bins, the estimator estimates source signals by filtering the transformed input signals through the respective unmixing filter configured with the calculated values of the coefficients. The second transformer transforms the estimated source signals on the respective frequency bins into time domain. The cost function is adapted to evaluate decorrelation between the estimated source signals.

According to an embodiment of the present invention, a computer-readable medium having computer program instructions recorded thereon is provided. When being executed by a processor, the instructions enable the processor to perform a method of performing convolutive blind source separation. According to the method, each of a plurality of input signals is transformed into frequency domain. Values of coefficients of unmixing filters corresponding to frequency bins are calculated by performing a gradient descent process on a cost function at least dependent on the coefficients of the unmixing filters. In each iteration of the gradient descent process, gradient terms for calculating the values of the same coefficient of the unmixing filters are adjusted to improve smoothness of the gradient terms across the frequency bins. With respect to each of the frequency bins, source signals are estimated by filtering the transformed input signals through the respective unmixing filter configured with the calculated values of the coefficients. The estimated source signals on the respective frequency bins are transformed into time domain. The cost function is adapted to evaluate decorrelation between the estimated source signals.

BRIEF DESCRIPTION OF DRAWINGS

The present invention is illustrated by way of examples, and not by way of limitation, in the figures of the accompanying drawings and in which like reference numerals refer to similar elements and in which:

FIG. 1 is a block diagram illustrating an example apparatus for performing convolutive blind source separation according to an embodiment of the present invention;

FIG. 2 is a flow chart illustrating an example method of adjusting gradient terms over frequency bins for calculating a coefficient;

FIG. 3 is a graph demonstrating the effectiveness of the de-permutation to improve smoothness of gradient terms across the frequency bins through a comparison between magnitudes of the gradient terms before and after the de-permutation;

FIG. 4 is a flow chart illustrating an example method of performing convolutive blind source separation according to an embodiment of the present invention; and

FIG. 5 is a block diagram illustrating an exemplary system for implementing aspects of the present invention.

DETAILED DESCRIPTION

The embodiments of the present invention are below described by referring to the drawings. It is to be noted that, for purpose of clarity, representations and descriptions about those components and processes known by those skilled in the art but unrelated to the present invention are omitted in the drawings and the description.

As will be appreciated by one skilled in the art, aspects of the present invention may be embodied as a system, method or computer program product. Accordingly, aspects of the present invention may take the form of an entirely hardware embodiment, an entirely software embodiment (including firmware, resident software, microcode, etc.) or an embodiment combining software and hardware aspects that may all generally be referred to herein as a “circuit,” “module” or “system.” Furthermore, aspects of the present invention may take the form of a computer program product embodied in one or more computer readable medium(s) having computer readable program code embodied thereon.

Any combination of one or more computer readable medium(s) may be utilized. The computer readable medium may be a computer readable signal medium or a computer readable storage medium. A computer readable storage medium may be, for example, but not limited to, an electronic, magnetic, optical, electromagnetic, infrared, or semiconductor system, apparatus, or device, or any suitable combination of the foregoing. More specific examples (a non-exhaustive list) of the computer readable storage medium would include the following: an electrical connection having one or more wires, a portable computer diskette, a hard disk, a random access memory (RAM), a read-only memory (ROM), an erasable programmable read-only memory (EPROM or Flash memory), an optical fiber, a portable compact disc read-only memory (CD-ROM), an optical storage device, a magnetic storage device, or any suitable combination of the foregoing. In the context of this document, a computer readable storage medium may be any tangible medium that can contain, or store a program for use by or in connection with an instruction execution system, apparatus, or device.

A computer readable signal medium may include a propagated data signal with computer readable program code embodied therein, for example, in baseband or as part of a carrier wave. Such a propagated signal may take any of a variety of forms, including, but not limited to, electro-magnetic, optical, or any suitable combination thereof.

A computer readable signal medium may be any computer readable medium that is not a computer readable storage medium and that can communicate, propagate, or transport a program for use by or in connection with an instruction execution system, apparatus, or device.

Program code embodied on a computer readable medium may be transmitted using any appropriate medium, including but not limited to wireless, wired line, optical fiber cable, RF, etc., or any suitable combination of the foregoing.

Computer program code for carrying out operations for aspects of the present invention may be written in any combination of one or more programming languages, including an object oriented programming language such as Java, Smalltalk, C++ or the like and conventional procedural programming languages, such as the “C” programming language or similar programming languages. The program code may execute entirely on the user's computer, partly on the user's computer, as a stand-alone software package, partly on the user's computer and partly on a remote computer or entirely on the remote computer or server. In the latter scenario, the remote computer may be connected to the user's computer through any type of network, including a local area network (LAN) or a wide area network (WAN), or the connection may be made to an external computer (for example, through the Internet using an Internet Service Provider).

Aspects of the present invention are described below with reference to flowchart illustrations and/or block diagrams of methods, apparatus (systems) and computer program products according to embodiments of the invention. It will be understood that each block of the flowchart illustrations and/or block diagrams, and combinations of blocks in the flowchart illustrations and/or block diagrams, can be implemented by computer program instructions. These computer program instructions may be provided to a processor of a general purpose computer, special purpose computer, or other programmable data processing apparatus to produce a machine, such that the instructions, which execute via the processor of the computer or other programmable data processing apparatus, create means for implementing the functions/acts specified in the flowchart and/or block diagram block or blocks.

These computer program instructions may also be stored in a computer readable medium that can direct a computer, other programmable data processing apparatus, or other devices to function in a particular manner, such that the instructions stored in the computer readable medium produce an article of manufacture including instructions which implement the function/act specified in the flowchart and/or block diagram block or blocks.

The computer program instructions may also be loaded onto a computer, other programmable data processing apparatus, or other devices to cause a series of operational steps to be performed on the computer, other programmable apparatus or other devices to produce a computer implemented process such that the instructions which execute on the computer or other programmable apparatus provide processes for implementing the functions/acts specified in the flowchart and/or block diagram block or blocks.

FIG. 1 is a block diagram illustrating an example apparatus 100 for performing convolutive blind source separation according to an embodiment of the present invention.

As illustrated in FIG. 1, apparatus 100 includes a transformer 101, a calculator 102, an estimator 103 and a transformer 104.

Sound sources 110-1 to 110-N emit sound signals S₁ to S_(N) respectively. Through respective convolutive channels 120, mixed signals of sound signals S₁ to S_(N) are captured by microphones 130-1 to 130-N respectively. The captured signals are converted into digital signals s₁ to s_(N) respectively.

Transformer 101 transforms digital signals s₁ to s_(N) into frequency domain respectively. For example, from each digital signal s_(i), transformer 101 may obtain a frame corresponding to time period from t to t+T, and convert the frame into frequency domain. Therefore, signals X(ω,t) is obtained, where X(ω,t)=[X₁(ω,t), . . . , X_(N)(ω,t)]^(T), and ω represents any one of frequency bins ω₁ to ω_(M). By repeating in this way, for each digital signal s_(i), transformer 101 may transform a series of frames into frequency domain.

With respect to each unmixing filter W(ω_(k),t) of unmixing filters W(ω₁,t) to W(ω_(M),t) corresponding to respective frequency bins ω₁ to ω_(M), calculator 102 calculates values W_(ij)(ω_(k),t) of coefficients W_(ij)(ω,t) of the unmixing filter W(ω_(k),t) by performing a gradient descent process on a cost function at least dependent on the coefficients W_(ij)(ω,t) of the unmixing filter W(ω,t).

To perform convolutive source separation, non-stationarity constraint is exploited. According to the non-stationarity constraint, it is possible to adopt a cost function f(W(ω,t)) to evaluate decorrelation between the estimated source signals Y_(i)(ω,t)∈Y(ω,t). If each of the estimated source signals includes less mixed components, the cost function f(W(ω,t)) approaches a minimum value. Through a gradient descent process, it is possible to make the cost function f(W(ω, t)) approach the minimum value in an iterative manner.

The gradient descent process is based on the observation that if a function f(W(ω,t)) is defined and differentiable in a neighborhood of a point W(ω,t₀), then it decreases fastest if one goes in the direction of the negative gradient of f(W(ω,t)) at W(ω,t₀)−∇f(W(ω, t₀)). It follows that, if W(ω,t₁)=W(ω,t₀)−μ∇f(W(ω, t₀)) for μ>0 a small enough number (also called as a step size), then f(W(ω, t₀))≧f(W(ω, t₁)). In the following, the term μ∇f(W(ω, t_(i)) is also called as a gradient term, which is the product of the step size μ and the gradient ∇f(W(ω, t_(i)). With this observation, it is possible to start with a guess W(ω,t₀) for a local minimum of f(W(ω,t)), and considers the sequence W(ω, t₀), W(ω,t₁), W(ω,t₂), . . . such that W(ω,t_(n+1))=W(ω,t_(n))−μ_(n)∇f(W(ω, t_(n))), n≧0. It is possible to obtain f(W(ω, t₀))≧f(W(ω, t₁))≧f(W(ω, t₂))≧ . . . , so hopefully the process converges to the desired local minimum.

For example, second-order statistics in the frequency domain is captured by the cross-power spectrum,

$\begin{matrix} \begin{matrix} {{R_{yy}\left( {\omega,t} \right)} = {E\left\lbrack {{Y\left( {\omega,t} \right)}{Y^{H}\left( {\omega,t} \right)}} \right\rbrack}} \\ {= {{W\left( {\omega,t} \right)}{R_{xx}\left( {\omega,t} \right)}{W^{H}\left( {\omega,t} \right)}}} \end{matrix} & (5) \end{matrix}$

where E[•] denotes the statistical expectation, W(ω,t) is a matrix where non-diagonal elements are coefficients and diagonal elements are assumed as unit gains, and R_(xx)(ω, t) is the cross-power spectrum of microphone signals. For example, in the TITO case,

$\begin{matrix} {{R_{xx}\left( {\omega,t} \right)} = \begin{bmatrix} {R_{x\; 1\; x\; 1}\left( {\omega,t} \right)} & {R_{x\; 1\; x\; 2}\left( {\omega,t} \right)} \\ {R_{x\; 2\; x\; 1}\left( {\omega,t} \right)} & {R_{x\; 2\; x\; 2}\left( {\omega,t} \right)} \end{bmatrix}} & (6) \end{matrix}$

where R_(xixj)(ω,t)=X_(i)(ω,t)X_(j)*(ω,t).

The goal is to minimize the cross-powers on the off-diagonal of this matrix, e.g. by minimizing the cost function:

$\begin{matrix} {J = {\sum\limits_{t,\omega}{{{R_{yy}\left( {\omega,t} \right)} - {\Lambda_{y}\left( {\omega,t} \right)}}}^{2}}} & (7) \end{matrix}$

where Λ_(y)(ω, t) is the diagonal component of an estimate of the sources' cross-power spectrum. In this case, its gradients with respect to the real and imaginary parts are obtained by taking partial derivatives formally with respect to the conjugate quantities W*(ω,t). Thus the gradient at time t is

$\begin{matrix} {\frac{\partial{J(t)}}{\partial{W^{*}\left( {\omega,t} \right)}} = {2\left( {{{W\left( {\omega,t} \right)}{R_{xx}\left( {\omega,t} \right)}{W^{H}\left( {\omega,t} \right)}} - {\Lambda_{y}\left( {\omega,t} \right)}} \right){W\left( {\omega,t} \right)}{R_{xx}\left( {\omega,t} \right)}}} & (8) \end{matrix}$

and the unmixing filter is estimated as

$\begin{matrix} {{W\left( {\omega,{t + 1}} \right)} = {{W\left( {\omega,t} \right)} - {{\mu \left( {\omega,t} \right)}\frac{\partial{J(t)}}{\partial{W^{*}\left( {\omega,t} \right)}}}}} & (9) \end{matrix}$

where μ(ω, t) is the adaptation step size function that is made in inverse proportion to the input signal powers. Therefore, the gradient term is

${\mu \left( {\omega,t} \right)}{\frac{\partial{J(t)}}{\partial{W^{*}\left( {\omega,t} \right)}}.}$

For another example, in the TITO case, gradients may be simplified as cross-power of two estimated source signals. For example, the gradient for calculating the coefficient W₁₂ may be calculated as Y₂*(ω, t)Y₁(ω, t) and thus the corresponding gradient term is

μ₁(ω, t)Y ₂*(ω, t)Y ₁(ω, t)   (10).

The gradient for calculating the coefficient W₂₁ may be calculated as Y₁*(ω, t)Y₂(ω, t), and thus the corresponding gradient term is

μ₂(ω, t)Y ₁*(ω, t)Y ₂(ω, t)   (11),

where μ₁(ω, t) and μ₂(ω, t) are the adaptation step size functions that are made in inverse proportion to the input signal powers. For example,

$\begin{matrix} {{\mu (\omega)} = \frac{c}{{E\left\lbrack {{X_{1}(\omega)}}^{2} \right\rbrack} + {E\left\lbrack {{X_{2}(\omega)}}^{2} \right\rbrack}}} & (12) \end{matrix}$

where c is a constant.

In this way, for each non-diagonal elements (coefficients W_(ij)(ω,t), i≠j) of the unmixing filter W(ω,t), a gradient descent process is performed.

If the convolutive problem is treated for each frequency bin as a separate problem, the source signals in each frequency bin may be estimated with an arbitrary permutation. If the permutation is not consistent across the frequency bins, then converting the signal back to the time domain will combine contributions from different sources into a single channel

It is possible to solve the permutation problem (de-permutation) by putting a consistency (smoothness) constraint on gradient terms across the frequency bins. In each iteration of the gradient descent process, that is, for each time t, calculator 102 adjusts the gradient terms μ∇f(W_(ij)(ω₁, t)) to μ∇f(W_(ij)(ω_(M), t)) for calculating the values of the same coefficient W_(ij) of the unmixing filters W(ω₁,t) to W(ω_(M),t) to improve smoothness of the gradient terms across the frequency bins ω₁ to ω_(M). The coefficients subjected to the adjustment may be some or all of the coefficients of the unmixing filters. For example, the coefficients subjected to the adjustment may be non-diagonal coefficients of the unmixing filters.

Various methods may be used to improve the smoothness of the gradient terms across the frequency bins by adjusting the gradient terms.

In an example, with respect to each of the coefficients W_(ij)(ω,t), it is possible to transform the gradient terms μ∇f(W_(ij)(ω_(i1), t)), . . . , μ∇f(W_(ij)(w_(iM), t)) over the frequency bins ω₁ to ω_(M) for calculating the values W_(ij)(ω₁, t) to W_(ij)(ω_(M), t) of the coefficient W_(ij)(ω,t) into a time domain filter of length T, de-emphasize coefficients of the time domain filter at time indices t exceeding a threshold Q smaller than the length T, and transform coefficients of the time domain filter from time domain into frequency domain through a length-T transformation, so as to obtain adjusted gradient terms over the frequency bins ω₁ to ω_(M). De-emphasizing may be implemented by setting the coefficients to zero, or multiplying the coefficients with respective weights smaller than 1 (for example, 0.1), that is, reducing the coefficients at time indices t exceeding the threshold Q relative to coefficients of the time domain filter not at time indices t exceeding the threshold Q.

FIG. 2 is a flow chart illustrating an example method 200 of adjusting gradient terms over frequency bins ω₁ to ω_(M) for calculating a coefficient W_(ij). In this example, the method is implemented in Matlab, where the frequency domain gradient includes 129 frequency bins, and the size of Fast Fourier Transformation (FFT) and the time domain filter are 256.

As illustrated in FIG. 2, method 200 starts from step 201. At step 203, an array tmp is formed of gradient terms μ∇f(W_(ij)(ω₁, t)), . . . , μ∇f(W_(ij)(ω₁₂₉, t)) (in array α) and complex conjugates of gradient terms μ∇f(W_(ij)(ω₁₂₈, t)), . . . , μ∇f(W_(ij)(χ₂, t)).

At step 205, Inverse FFT of size 256 is performed on array tmp to obtain a time domain filter of length 256, and an array at is formed of the coefficients of the time domain filter.

At step 207, coefficients in array at at time indices from Q+1 to T are set to zero.

At step 209, FFT of size 256 is performed on array at to obtain an array aa formed of 256 new coefficients.

At step 211, array a is updated with the first 129 coefficients of array aa.

The method ends at step 213.

FIG. 3 is a graph demonstrating the effectiveness of the de-permutation to improve smoothness of gradient terms across the frequency bins through a comparison between magnitudes of the gradient terms before and after the de-permutation. As illustrated in FIG. 3, the magnitude before the de-permutation exhibits poor smoothness over frequency bins, and the magnitude after the de-permutation exhibits good smoothness over the frequency bins.

Returning to FIG. 1, calculator 102 provides unmixing filter W(ω,t) to estimator 103. With respect to each of the frequency bins, estimator 103 estimates source signals Y(ω,t) by filtering the transformed input signals X(ω,t) through the respective unmixing filter W(ω,t) configured with the calculated values of the coefficients. The process of estimator 103 can be represented with Equation (1).

Transformer 104 transforms the estimated source signals on the respective frequency bins into time domain, so as to produce separated source signals S′₁ to S′_(N).

According to the embodiments, the de-permutation can be performed based on the gradient terms. This can be an alternative or addition to the de-permutation performed in other ways.

In a further embodiment of apparatus 100, calculator 102 may be further configured to adjust the threshold Q in at least one iteration of the gradient descent process. The at least one iteration may comprise arbitrary iteration, periodic iteration or every iteration.

In an example, the threshold Q may be adjusted according to the proportion of the unmixing filters in a divergence condition. In this case, if the proportion in the current iteration is higher, or higher than that in the previous iteration, the threshold Q which is smaller or smaller than that in the previous iteration is adopted, and if the proportion in the current iteration is lower, or lower than that in the previous iteration, the threshold Q which is greater or greater than that in the previous iteration is adopted. The divergence condition may be determined based on whether the unmixing filter is stable. In an example, the divergence condition of the unmixing filter corresponding to the respective frequency bin is determined if the power ratio of the output to the input of the unmixing filter is greater than a threshold D.

As an example, the power ratio Ratio may be represented as

$\begin{matrix} {{{Ratio} = \frac{{E\left\lbrack {Y_{1}}^{2} \right\rbrack}{E\left\lbrack {Y_{2}}^{2} \right\rbrack}}{{E\left\lbrack {X_{1}}^{2} \right\rbrack}{E\left\lbrack {X_{2}}^{2} \right\rbrack}}}{or}} & (13) \\ {{Ratio} = \frac{{E\left\lbrack {Y_{1}}^{2} \right\rbrack} + {E\left\lbrack {Y_{2}}^{2} \right\rbrack}}{{E\left\lbrack {X_{1}}^{2} \right\rbrack} + {E\left\lbrack {X_{2}}^{2} \right\rbrack}}} & (14) \end{matrix}$

The threshold D may be determined according to the requirement on the smoothness of the gradient terms. The higher requirement determines the smaller threshold D, and the lower requirement determines the greater threshold D. For example, the threshold D is equal to or smaller than 1.

In another example, the threshold Q may be adjusted according to the smoothness of the gradient terms between the frequency bins. In this case, the threshold Q is increased, e.g. to 2Q or the maximum length allowed if the smoothness is equal to or higher than a threshold P, and is reduced, e.g. to Q/2 if the smoothness is lower than the threshold P. Various measures may be used to evaluate the smoothness. For example, it is possible to calculate correlations of gradient terms between neighboring frequency bins and then average the correlations as the smoothness. The threshold P may be determined according to the requirement on the smoothness of the gradient terms. The higher requirement determines the higher threshold P, and the lower requirement determines the lower threshold P. In an example, the threshold P is equal to or greater than 0.5.

In another example, the threshold Q may be adjusted according to the consistency of the spectrum of the estimated source signals. In this case, the threshold Q is increased, e.g. to 2Q or the maximum length allowed if the consistency is equal to or higher than a threshold G, and is reduced, e.g. to Q/2 if the consistency is lower than the threshold G. Various measures may be used to evaluate the consistency of the spectrum of the estimated source signals. For example, it is possible to calculate correlations of the estimated source signals between neighboring frequency bins and average the correlations as the consistency of the spectrum of the estimated source signals. The threshold G may be determined according to the requirement on the consistency of the spectrum. The higher requirement determines the higher threshold G, and the lower requirement determines the lower threshold G. In an example, the threshold G is equal to or greater than 0.5.

In a further embodiment of apparatus 100, calculator 102 may be further configured to adjust the gradient terms by choosing the permutation that minimizes the Euclidean distances or maximizes correlations of gradient terms between neighboring frequency bins. In this case, it is possible to try arbitrary permutations of the gradient terms and choose the permutation that minimizes the Euclidean distances or maximizes correlations of gradient terms between neighboring frequency bins. The Euclidean distances or correlations may be evaluated with their total sum or average.

In a further embodiment of apparatus 100, calculator 102 may be further configured to determine whether the unmixing filter corresponding to each of the frequency bins is in a divergence condition or not. The divergence condition may be determined based on whether the unmixing filter is stable. In an example, the divergence condition of the unmixing filter corresponding to the respective frequency bin is determined if the power ratio of the output to the input of the unmixing filter is greater than the threshold D.

Calculator 102 may be further configured to adopt the gradient terms calculated in the previous iteration as the gradient terms for use in the current iteration if the unmixing filter is in the divergence condition, and calculate the gradient terms for use in the current iteration if the unmixing filter is not in the divergence condition.

According to this embodiment, previous gradient terms are used for a particular frequency bin if the corresponding unmixing filter is deemed unstable, or new gradient terms are calculated if otherwise. Then the gradient terms are subjected to de-permutation. From Eqs. (5) and (6), it can be seen that such an approach may achieve a balance between maintaining existing filters (previously regularized) and adapting to the new gradient direction.

In a further embodiment of apparatus 100, in case of TITO, calculator 102 may be further configured to, with respect to each of the frequency bins co, calculate the gradient terms for use in the current iteration according to

∇_(w) ₁₂ =μ₁((X ₁ X ₁ *W ₂₁ *+W ₁₂ X ₂ X ₁*W₂₁ *+X ₁ X ₂ *+W ₁₂ X ₂ X ₂*)Y ₂ X ₂*).   (15)

∇_(w) ₂₁ =μ₂((W ₂₁ X ₁ X ₁ *+X ₂ X ₁ *+W ₂₁ X ₁ X ₂ *W ₁₂ *+X ₂ X ₂ *W ₂*)Y ₁ X ₁*);   (16)

or according to

∇_(w) ₁₂ =μ₁(Y ₁ Y ₂*(W ₂₁ X ₁ X ₂ *+X ₂ X ₂*)),   (17)

∇_(w) ₂₁ =μ₂(Y ₂ Y ₁*(X ₁ X ₁ *+W ₁₂ X ₂ X ₁*)),   (18)

or according to

∇_(w) ₁₂ =μ₁((X ₁ +W ₁₂ X ₂)Y ₂*),   (19)

∇_(w) ₂₁ =μ₂((X ₂ +W ₂₁ X ₁)Y ₁*),   (20)

where

-   μ₁ and μ₂ are step size functions, -   ∇_(w) ₁₂ is the gradient term for calculating the value of the     coefficient W₁₂, ∇ _(w) ₂₁ is the gradient term for calculating the     value of the coefficient W₂₁, -   X₁ and X₂ are the transformed input signals in the previous     iteration respectively, Y₁ is the source signal estimated as     X₁+W₁₂X₂ in the previous iteration, Y₂ is the source signal     estimated as X₂+W₂₁X₁ in the previous iteration, and * represents     complex conjugate.

Because at least some of calculations of XW are replaced with the filtered results, the calculating cost may be reduced. Further, by calculating the gradient terms based on Eqs. (10) and (11), the system can be simple, efficient and stable.

FIG. 4 is a flow chart illustrating an example method 400 of performing convolutive blind source separation according to an embodiment of the present invention.

As illustrated in FIG. 4, method 400 starts from step 401. At step 403, digital signals s₁ to s_(N) obtained through respective microphones are transformed into frequency domain respectively. For example, from each digital signal s_(i), it is possible to obtain a frame corresponding to time period from t to t+T, and convert the frame into frequency domain. Therefore, signals X(ω,t) is obtained, where X(ω,t)=[X₁(ω,t), . . . , X_(N)(ω,t)]^(T), and ω represents any one of frequency bins ω₁ to ω_(M). By repeating in this way, for each digital signal s_(i), it is possible to transform a series of frames into frequency domain.

At step 405, with respect to each unmixing filter W(ω_(k),t) of unmixing filters W(ω₁,t) to W(ω_(M), t) corresponding to respective frequency bins ω₁ to ω_(M), values W_(ij)(ω_(k),t) of coefficients W_(ij)(ω,t) of the unmixing filter W(ω_(k),t) are calculated by performing a gradient descent process on a cost function at least dependent on the coefficients W_(ij)(ω,t) of the unmixing filter W(ω,t).

To perform convolutive source separation, non-stationarity constraint is exploited. According to the non-stationarity constraint, it is possible to adopt a cost function f(W(ω, t)) to evaluate decorrelation between the estimated source signals Y_(i)(ω,t)∈Y(ω,t). If each of the estimated source signals includes less mixed components, the cost function f(W(ω,t)) approaches a minimum value. Through a gradient descent process, it is possible to make the cost function f(W(ω,t)) approach the minimum value in an iterative manner.

For example, second-order statistics in the frequency domain is captured by the cross-power spectrum in Eq. (5). The goal is to minimize the cross-powers on the off-diagonal of this matrix, e.g. by minimizing the cost function in Eq. (7). In this case, its gradients with respect to the real and imaginary parts are obtained by taking partial derivatives formally with respect to the conjugate quantities W*(ω,t). Thus the gradient at time t is estimated as in Eq. (8) and the unmixing filter is estimated as in Eq. (9).

For another example, in the TITO case, the gradients may be simplified as cross-power of two estimated source signals. For example, the gradient term for calculating the coefficient W₁₂ may be calculated based on Eq. (10), and the gradient term for calculating the coefficient W₂₁ may be calculated based on Eq. (11).

In this way, for each non-diagonal elements (coefficients W_(ij)(ω,t), i≠j) of the unmixing filter W(ω,t), a gradient descent process is performed.

It is possible to solve the permutation problem (de-permutation) by putting a consistency (smoothness) constraint on gradient terms across the frequency bins. In each iteration of the gradient descent process, that is, for each time t, the gradient terms μ∇f(W_(ij)(ω₁, t)) to μ∇f(W_(ij)(ω_(M), t)) for calculating the values of the same coefficient W_(ij) of the unmixing filters W(ω₁,t) to W(ω_(M),t) are adjusted to improve smoothness of the gradient terms across the frequency bins ω₁ to ω_(M). The coefficients subjected to the adjustment may be some or all of the coefficients of the unmixing filters. For example, the coefficients subjected to the adjustment may be non-diagonal coefficients of the unmixing filters.

Various methods may be used to improve the smoothness of the gradient terms across the frequency bins by adjusting the gradient terms.

In an example, with respect to each of the coefficients W_(ij)(ω,t), it is possible to transform the gradient terms μ∇f(W_(ij)(ω_(i1), t)), . . . , μ∇f(W_(ij)(ω_(iM), t)) over the frequency bins ω₁ to ω_(M) for calculating the values W_(ij)(ω₁, t) to W_(ij)(ω_(M), t) of the coefficient W_(ij)(ω,t) into a time domain filter of length T, de-emphasize coefficients of the time domain filter at time indices t exceeding a threshold Q smaller than the length T, and transform coefficients of the time domain filter from time domain into frequency domain through a length-T transformation, so as to obtain adjusted gradient terms over the frequency bins ω₁ to ω_(M). De-emphasizing may be implemented by setting the coefficients to zero, or multiplying the coefficients with respective weights smaller than 1 (for example, 0.1), that is, reducing the coefficients at time indices t exceeding the threshold Q relative to coefficients of the time domain filter not at time indices t exceeding the threshold Q.

The unmixing filter W(ω,t) obtained at step 405 is used at step 407. At step 407, with respect to each of the frequency bins, source signals Y(ω,t) are estimated by filtering the transformed input signals X(ω,t) through the respective unmixing filter W(ω,t) configured with the calculated values of the coefficients. The process of step 407 can be represented with Equation (1).

At step 409, the estimated source signals on the respective frequency bins are transformed into time domain, so as to produce separated source signals S′₁ to S′_(N).

At step 411, it is determined whether there are other digital signals to be processed. If YES, the process returns to step 403. If NO, method 400 ends at step 413.

In a further embodiment of method 400, step 405 may further comprise adjusting the threshold Q in at least one iteration of the gradient descent process. The at least one iteration may comprises arbitrary iteration, periodic iteration or every iteration.

In an example, the threshold Q may be adjusted according to the proportion of the unmixing filters in a divergence condition. In this case, if the proportion in the current iteration is higher, or higher than that in the previous iteration, the threshold Q which is smaller or smaller than that in the previous iteration is adopted, and if the proportion in the current iteration is lower, or lower than that in the previous iteration, the threshold Q which is greater or greater than that in the previous iteration is adopted. The divergence condition may be determined based on whether the unmixing filter is stable. In an example, the divergence condition of the unmixing filter corresponding to the respective frequency bin is determined if the power ratio of the output to the input of the unmixing filter is greater than a threshold D.

The threshold D may be determined according to the requirement on the smoothness of the gradient terms. The higher requirement determines the smaller threshold D, and the lower requirement determines the greater threshold D. For example, the threshold D is equal to or smaller than 1.

In another example, the threshold Q may be adjusted according to the smoothness of the gradient terms between the frequency bins. In this case, the threshold Q is increased, e.g. to 2Q or the maximum length allowed if the smoothness is equal to or higher than a threshold P, and is reduced, e.g. to Q/2 if the smoothness is lower than the threshold P. Various measures may be used to evaluate the smoothness. For example, it is possible to calculate correlations of gradient terms between neighboring frequency bins and then average the correlations as the smoothness. The threshold P may be determined according to the requirement on the smoothness of the gradient terms. The higher requirement determines the higher threshold P, and the lower requirement determines the lower threshold P. In an example, the threshold P is equal to or greater than 0.5.

In another example, the threshold Q may be adjusted according to the consistency of the spectrum of the estimated source signals. In this case, the threshold Q is increased, e.g. to 2Q or the maximum length allowed if the consistency is equal to or higher than a threshold G, and is reduced, e.g. to Q/2 if the consistency is lower than the threshold G. Various measures may be used to evaluate the consistency of the spectrum of the estimated source signals. For example, it is possible to calculate correlations of the estimated source signals between neighboring frequency bins and average the correlations as the consistency of the spectrum of the estimated source signals. The threshold G may be determined according to the requirement on the consistency of the spectrum. The higher requirement determines the higher threshold G, and the lower requirement determines the lower threshold G. In an example, the threshold G is equal to or greater than 0.5.

In a further embodiment of method 400, step 405 may further comprise adjusting the gradient terms by choosing the permutation that minimizes the Euclidean distances or maximizes correlations of gradient terms between neighboring frequency bins. In this case, it is possible to try arbitrary permutations of the gradient terms and choose the permutation that minimizes the Euclidean distances or maximizes correlations of gradient terms between neighboring frequency bins. The Euclidean distances or correlations may be evaluated with their total sum or average.

In a further embodiment of method 400, step 405 may further comprise determining whether the unmixing filter corresponding to each of the frequency bins is in a divergence condition or not. The divergence condition may be determined based on whether the unmixing filter is stable. In an example, the divergence condition of the unmixing filter corresponding to the respective frequency bin is determined if the power ratio of the output to the input of the unmixing filter is greater than the threshold D.

In this case, step 405 may further comprise adopting the gradient terms calculated in the previous iteration as the gradient terms for use in the current iteration if the unmixing filter is in the divergence condition, and calculating the gradient terms for use in the current iteration if the unmixing filter is not in the divergence condition.

According to this embodiment, previous gradient terms are used for a particular frequency bin if the corresponding unmixing filter is deemed unstable, or new gradient terms are calculated if otherwise. Then the gradient terms are subjected to de-permutation. From Eqs. (5) and (6), it can be seen that such an approach may achieve a balance between maintaining existing filters (previously regularized) and adapting to the new gradient direction.

In a further embodiment of method 400, in case of TITO, step 405 may further comprise, with respect to each of the frequency bins co, calculating the gradient terms for use in the current iteration according to Eqs. (15) and (16), or according to Eqs. (17) and (18), or according to Eqs. (19) and (20).

FIG. 5 is a block diagram illustrating an exemplary system for implementing the aspects of the present invention.

In FIG. 5, a central processing unit (CPU) 501 performs various processes in accordance with a program stored in a read only memory (ROM) 502 or a program loaded from a storage section 508 to a random access memory (RAM) 503. In the RAM 503, data required when the CPU 501 performs the various processes or the like is also stored as required.

The CPU 501, the ROM 502 and the RAM 503 are connected to one another via a bus 504. An input l output interface 505 is also connected to the bus 504.

The following components are connected to the input/output interface 505: an input section 506 including a keyboard, a mouse, or the like; an output section 507 including a display such as a cathode ray tube (CRT), a liquid crystal display (LCD), or the like, and a loudspeaker or the like; the storage section 508 including a hard disk or the like; and a communication section 509 including a network interface card such as a LAN card, a modem, or the like. The communication section 509 performs a communication process via the network such as the internet.

A drive 510 is also connected to the input/output interface 505 as required. A removable medium 511, such as a magnetic disk, an optical disk, a magneto-optical disk, a semiconductor memory, or the like, is mounted on the drive 510 as required, so that a computer program read therefrom is installed into the storage section 508 as required.

In the case where the above-described steps and processes are implemented by the software, the program that constitutes the software is installed from the network such as the internet or the storage medium such as the removable medium 511.

The terminology used herein is for the purpose of describing particular embodiments only and is not intended to be limiting of the invention. As used herein, the singular forms “a”, “an” and “the” are intended to include the plural forms as well, unless the context clearly indicates otherwise. It will be further understood that the terms “comprises” and/or “comprising,” when used in this specification, specify the presence of stated features, integers, steps, operations, elements, and/or components, but do not preclude the presence or addition of one or more other features, integers, steps, operations, elements, components, and/or groups thereof.

The corresponding structures, materials, acts, and equivalents of all means or step plus function elements in the claims below are intended to include any structure, material, or act for performing the function in combination with other claimed elements as specifically claimed. The description of the present invention has been presented for purposes of illustration and description, but is not intended to be exhaustive or limited to the invention in the form disclosed. Many modifications and variations will be apparent to those of ordinary skill in the art without departing from the scope and spirit of the invention. The embodiment was chosen and described in order to best explain the principles of the invention and the practical application, and to enable others of ordinary skill in the art to understand the invention for various embodiments with various modifications as are suited to the particular use contemplated.

The following exemplary embodiments (each an “EE”) are described.

EE 1. A method of performing convolutive blind source separation, comprising:

transforming each of a plurality of input signals into frequency domain;

calculating values of coefficients of unmixing filters corresponding to frequency bins by performing a gradient descent process on a cost function at least dependent on the coefficients of the unmixing filters, wherein in each iteration of the gradient descent process, gradient terms for calculating the values of the same coefficient of the unmixing filters are adjusted to improve smoothness of the gradient terms across the frequency bins;

with respect to each of the frequency bins, estimating source signals by filtering the transformed input signals through the respective unmixing filter configured with the calculated values of the coefficients; and

transforming the estimated source signals on the respective frequency bins into time domain,

wherein the cost function is adapted to evaluate decorrelation between the estimated source signals.

EE 2. The method according to EE1, wherein the number of the plurality of input signals is two.

EE 3. The method according to EE2, wherein with respect to each of the frequency bins, the gradient terms for use in the current iteration are calculated according to one of the following methods:

∇_(w) ₁₂ =μ₁((X ₁ X ₁ *W ₂₁ *+W ₁₂ X ₂ X ₁ *W ₂₁ *+X ₁ X ₂ *+W ₁₂ X ₂ X ₂*)Y ₂ X ₂*),

∇_(w) ₂₁ =μ₂((W ₂₁ X ₁ X ₁ *+X ₂ X ₁ *+W ₂₁ X ₁ X ₂ *W ₁₂ *+X ₂ X ₂ *W ₁₂*)Y ₁ X ₁*);

∇_(w) ₁₂ =μ₁(Y ₁ Y ₂*(W ₂₁ X ₁ X ₂ *+X ₂ X ₂*)),

∇_(w) ₂₁ =μ₂(Y ₂ Y ₁*(X ₁ X ₁ *+W ₁₂ X ₂ X ₁*)); and

∇_(w) ₁₂ =μ₁((X ₁ +W ₁₂ X ₂)Y ₂*),

∇_(w) ₂₁ =μ₂((X ₂ +W ₂₁ X ₁)Y ₁*),

where

μ₁ and μ₂ are step size functions,

∇_(w) ₁₂ is the gradient term for calculating the value of the coefficient W₁₂, ∇_(w) ₂₁ is the gradient term for calculating the value of the coefficient W₂₁,

X₁ and X₂ are the transformed input signals in the previous iteration respectively, Y₁ is the source signal estimated as X₁+W₁₂X₂ in the previous iteration, Y₂ is the source signal estimated as X₂+W₂₁X₁ in the previous iteration, and * represents complex conjugate.

EE 4. The method according to EE2, wherein with respect to each of the frequency bins, the gradient terms for use in the current iteration are calculated as

∇₁=μ₁ Y ₁ Y ₂*,

∇₂=μ₂ Y ₂ Y ₁*;

where

μ₁ and μ₂ are step size functions,

∇₁ is the gradient term for calculating the value of the coefficient W₁₂, ∇₂ is the gradient term for calculating the value of the coefficient W₂₁,

Y₁ is the source signal estimated as X₁+W₁₂X₂ in the previous iteration, Y₂ is the source signal estimated as X₂+W₂₁X₁ in the previous iteration, and * represents complex conjugate.

EE 5. The method according to EE1, wherein with respect to each of the frequency bins, the calculating of the values comprises:

determining whether the unmixing filter is in a divergence condition or not;

if the unmixing filter is in the divergence condition, adopting the gradient terms calculated in the previous iteration as the gradient terms for use in the current iteration; and

if the unmixing filter is not in the divergence condition, calculating the gradient terms for use in the current iteration.

EE 6. The method according to EE1, wherein the adjusting comprises:

with respect to each of the coefficients, transforming the gradient terms over the frequency bins for calculating the coefficient into a time domain filter of length T;

de-emphasizing coefficients of the time domain filter at time indices exceeding a first threshold smaller than the length T; and

transforming coefficients of the time domain filter from time domain into frequency domain through a length-T transformation.

EE 7. The method according to EE6, wherein the de-emphasizing of the coefficients comprises zeroing the coefficients at time indices exceeding the first threshold, or reducing the coefficients at time indices exceeding the first threshold relative to coefficients of the time domain filter not at time indices exceeding the first threshold.

EE 8. The method according to EE6, wherein the first threshold is adjusted in at least one iteration of the gradient descent process according to the proportion of the unmixing filters in a divergence condition, where the higher the proportion is, the smaller the first threshold is.

EE 9. The method according to EE6, wherein the first threshold is adjusted in at least one iteration of the gradient descent process according to the smoothness, where the first threshold is increased if the smoothness is equal to or higher than a second threshold, and is reduced if the smoothness is lower than the second threshold.

EE 10. The method according to EE9, wherein the smoothness is evaluated by calculating correlations of gradient terms between neighboring frequency bins and then averaging the correlations.

EE 11. The method according to EE10, wherein the second threshold is equal to or greater than 0.5.

EE 12. The method according to EE6, wherein the first threshold is adjusted in at least one iteration of the gradient descent process according to consistency of the spectrum of the estimated source signals, where the first threshold is increased if the consistency is equal to or higher than a third threshold, and is reduced if the consistency is lower than the third threshold.

EE 13. The method according to EE11, wherein the consistency is evaluated by calculating correlations of the estimated source signals between neighboring frequency bins and averaging the correlations.

EE 14. The method according to EE13, wherein the third threshold is equal to or greater than 0.5.

EE 15. The method according to EE5 or 8, wherein the divergence condition of the unmixing filter is determined if the power ratio of the output to the input of the unmixing filter is greater than a fourth threshold.

EE 16. The method according to EE15, wherein the fourth threshold is equal to or smaller than 1.

EE 17. The method according to EE1, wherein the gradient terms are adjusted by choosing one of permutations that minimizes the Euclidean distances or maximizes correlations of gradient terms between neighboring frequency bins.

EE 18. An apparatus for performing convolutive blind source separation, comprising:

a first transformer which transforms each of a plurality of input signals into frequency domain;

a calculator which calculates values of coefficients of unmixing filters corresponding to frequency bins by performing a gradient descent process on a cost function at least dependent on the coefficients of the unmixing filters, wherein in each iteration of the gradient descent process, gradient terms for calculating the values of the same coefficient of the unmixing filter are adjusted to improve smoothness of the gradient terms across the frequency bins;

an estimator which, with respect to each of the frequency bins, estimates source signals by filtering the transformed input signals through the respective unmixing filter configured with the calculated values of the coefficients; and

a second transformer which transforms the estimated source signals on the respective frequency bins into time domain,

wherein the cost function is adapted to evaluate decorrelation between the estimated source signals.

EE 19. The apparatus according to EE18, wherein the number of the plurality of input signals is two.

EE 20. The apparatus according to EE19, wherein the calculator is configured to, with respect to each of the frequency bins, calculate the gradient terms for use in the current iteration according to one of the following methods:

∇_(w) ₁₂ =μ₁((X ₁ X ₁ *W ₂₁ *+W ₁₂ X ₂ X ₁ *W ₂₁ *+X ₁ X ₂ *+W ₁₂ X ₂ X ₂*)Y ₂ X ₂*),

∇_(w) ₂₁ =μ₂((W ₂₁ X ₁ X ₁ *+X ₂ X ₁ *+W ₂₁ X ₁ X ₂ *W ₁₂ *+X ₂ X ₂ *W ₁₂*)Y ₁ X ₁*);

∇_(w) ₁₂ =μ₁(Y ₁ Y ₂*(W ₂₁ X ₁ X ₂ *+X ₂ X ₂*)),

∇_(w) ₂₁ =μ₂(Y ₂ Y ₁*(X ₁ X ₁ *+W ₁₂ X ₂ X ₁*)); and

∇_(w) ₁₂ =μ₁((X ₁ +W ₁₂ X ₂)Y ₂*),

∇_(w) ₂₁ =μ₂((X ₂ +W ₂₁ X ₁)Y ₁*),

where

μ₁ and μ₂ are step size functions,

∇_(w) 12 is the gradient term for calculating the value of the coefficient W₁₂, ∇_(w) ₂₁ is the gradient term for calculating the value of the coefficient W₂₁,

X₁ and X₂ are the transformed input signals in the previous iteration respectively, Y₁ is the source signal estimated as X₁+W₁₂X₂ in the previous iteration, Y₂ is the source signal estimated as X₂+W₂₁X₁ in the previous iteration, and * represents complex conjugate.

EE 21. The apparatus according to EE19, wherein the calculator is configured to, with respect to each of the frequency bins, calculate the gradient terms for use in the current iteration as

∇₁=μ₁ Y ₁ Y ₂*,

∇₂=μ₂ Y ₂ Y ₁*;

where

μ₁ and μ₂ are step size functions,

∇₁ is the gradient term for calculating the value of the coefficient W₁₂, ∇₂ is the gradient term for calculating the value of the coefficient W₂₁,

Y₁ is the source signal estimated as X₁+W₁₂X₂ in the previous iteration, Y₂ is the source signal estimated as X₂+W₂₁X₁ in the previous iteration, and * represents complex conjugate.

EE 22. The apparatus according to EE18, wherein the calculator is further configured to, with respect to each of the frequency bins, determine whether the unmixing filter is in a divergence condition or not, adopt the gradient terms calculated in the previous iteration as the gradient terms for use in the current iteration if the unmixing filter is in the divergence condition, and calculate the gradient terms for use in the current iteration if the unmixing filter is not in the divergence condition.

EE 23. The apparatus according to EE18, wherein the calculator is configured to, with respect to each of the coefficients, transform the gradient terms over the frequency bins for calculating the coefficient into a time domain filter of length T, de-emphasize coefficients of the time domain filter at time indices exceeding a first threshold smaller than the length T, and transform coefficients of the time domain filter from time domain into frequency domain through a length-T transformation.

EE 24. The apparatus according to EE23, wherein the de-emphasizing of the coefficients comprises zeroing the coefficients at time indices exceeding the first threshold, or reducing the coefficients at time indices exceeding the first threshold relative to coefficients of the time domain filter not at time indices exceeding the first threshold.

EE 25. The apparatus according to EE23, wherein the calculator is further configured to adjust the first threshold in at least one iteration of the gradient descent process according to the proportion of the unmixing filters in a divergence condition, where the higher the proportion is, the smaller the first threshold is.

EE 26. The apparatus according to EE23, wherein the calculator is further configured to adjust the first threshold in at least one iteration of the gradient descent process according to the smoothness, where the first threshold is increased if the smoothness is equal to or higher than a second threshold, and is reduced if the smoothness is lower than the second threshold.

EE 27. The apparatus according to EE26, wherein the smoothness is evaluated by calculating correlations of gradient terms between neighboring frequency bins and then averaging the correlations.

EE 28. The apparatus according to EE27, wherein the second threshold is equal to or greater than 0.5.

EE 29. The apparatus according to EE23, wherein the calculator is further configured to adjust the first threshold in at least one iteration of the gradient descent process according to consistency of the spectrum of the estimated source signals, where the first threshold is increased if the consistency is equal to or higher than a third threshold, and is reduced if the consistency is lower than the third threshold.

EE 30. The apparatus according to EE29, wherein the consistency is evaluated by calculating correlations of the estimated source signals between neighboring frequency bins and averaging the correlations.

EE 31. The apparatus according to EE30, wherein the third threshold is equal to or greater than 0.5.

EE 32. The apparatus according to EE22 or 25, wherein the divergence condition of the unmixing filter is determined if the power ratio of the output to the input of the unmixing filter is greater than a fourth threshold.

EE 33. The apparatus according to EE32, wherein the fourth threshold is equal to or smaller than 1.

EE 34. The apparatus according to EE18, wherein the calculator is further configured to adjust the gradient terms by choosing one of permutations that minimizes the Euclidean distances or maximizes correlations of gradient terms between neighboring frequency bins.

EE 35. A computer-readable medium having computer program instructions recorded thereon, when being executed by a processor, the instructions enabling the processor to perform a method of convolutive blind source separation based on second order statistics comprising:

transforming each of a plurality of input signals into frequency domain;

calculating values of coefficients of unmixing filters corresponding to frequency bins by performing a gradient descent process on a cost function at least dependent on the coefficients of the unmixing filters, wherein in each iteration of the gradient descent process, gradient terms for calculating the values of the same coefficient of the unmixing filters are adjusted to improve smoothness of the gradient terms across the frequency bins;

with respect to each of the frequency bins, estimating source signals by filtering the transformed input signals through the respective unmixing filter configured with the calculated values of the coefficients; and

transforming the estimated source signals on the respective frequency bins into time domain,

wherein the cost function is adapted to evaluate decorrelation between the estimated source signals. 

1. A method of performing convolutive blind source separation, comprising: transforming each of a plurality of input signals into frequency domain; calculating values of coefficients of unmixing filters corresponding to frequency bins by performing a gradient descent process on a cost function at least dependent on the coefficients of the unmixing filters, wherein in each iteration of the gradient descent process, gradient terms for calculating the values of the same coefficient of the unmixing filters are adjusted to improve smoothness of the gradient terms across the frequency bins; with respect to each of the frequency bins, estimating source signals by filtering the transformed input signals through the respective unmixing filter configured with the calculated values of the coefficients; and transforming the estimated source signals on the respective frequency bins into time domain, wherein the cost function is adapted to evaluate decorrelation between the estimated source signals.
 2. The method according to claim 1, wherein the number of the plurality of input signals is two.
 3. The method according to claim 2, wherein with respect to each of the frequency bins, the gradient terms for use in the current iteration are calculated according to one of the following methods: ∇_(w) ₁₂ =μ₁((X ₁ X ₁ *W ₂₁ *+W ₁₂ X ₂ X ₁ *W ₂₁ *+X ₁ X ₂ *+W ₁₂ X ₂ X ₂*)Y ₂ X ₂*), ∇_(w) ₂₁ =μ₂((W ₂₁ X ₁ X ₁ *+X ₂ X ₁ *+W ₂₁ X ₁ X ₂ *W ₁₂ *+X ₂ X ₂ *W ₁₂*)Y ₁ X ₁*); ∇_(w) ₁₂ =μ₁(Y ₁ Y ₂*(W ₂₁ X ₁ X ₂ *+X ₂ X ₂*)), ∇_(w) ₂₁ =μ₂(Y ₂ Y ₁*(X ₁ X ₁ *+W ₁₂ X ₂ X ₁*)); and ∇_(w) ₁₂ =μ₁((X ₁ +W ₁₂ X ₂)Y ₂*), ∇_(w) ₂₁ =μ₂((X ₂ +W ₂₁ X ₁)Y ₁*), where μ₁ and μ₂ are step size functions, ∇_(w) ₁₂ is the gradient term for calculating the value of the coefficient W₁₂, ∇_(w) ₂₁ is the gradient term for calculating the value of the coefficient W₂₁, X₁ and X₂ are the transformed input signals in the previous iteration respectively, Y₁ is the source signal estimated as X₁+W₁₂X₂ in the previous iteration, Y₂ is the source signal estimated as X₂+W₂₁X₁ in the previous iteration, and * represents complex conjugate.
 4. The method according to claim 2, wherein with respect to each of the frequency bins, the gradient terms for use in the current iteration are calculated as ∇₁=μ₁ Y ₁ Y ₂*, ∇₂=μ₂ Y ₂ Y ₁*; where μ₁ and μ₂ are step size functions, ∇₁ is the gradient term for calculating the value of the coefficient W₁₂, ∇₂ is the gradient term for calculating the value of the coefficient W₂₁, Y₁ is the source signal estimated as X₁+W₁₂X₂ in the previous iteration, Y₂ is the source signal estimated as X₂+W₂₁X₁ in the previous iteration, and * represents complex conjugate.
 5. The method according to claim 1, wherein with respect to each of the frequency bins, the calculating of the values comprises: determining whether the unmixing filter is in a divergence condition or not; if the unmixing filter is in the divergence condition, adopting the gradient terms calculated in the previous iteration as the gradient terms for use in the current iteration; and if the unmixing filter is not in the divergence condition, calculating the gradient terms for use in the current iteration.
 6. The method according to claim 1, wherein the adjusting comprises: with respect to each of the coefficients, transforming the gradient terms over the frequency bins for calculating the coefficient into a time domain filter of length T; de-emphasizing coefficients of the time domain filter at time indices exceeding a first threshold smaller than the length T; and transforming coefficients of the time domain filter from time domain into frequency domain through a length-T transformation.
 7. The method according to claim 6, wherein the de-emphasizing of the coefficients comprises zeroing the coefficients at time indices exceeding the first threshold, or reducing the coefficients at time indices exceeding the first threshold relative to coefficients of the time domain filter not at time indices exceeding the first threshold.
 8. The method according to claim 6, wherein the first threshold is adjusted in at least one iteration of the gradient descent process according to the proportion of the unmixing filters in a divergence condition, where the higher the proportion is, the smaller the first threshold is.
 9. The method according to claim 6, wherein the first threshold is adjusted in at least one iteration of the gradient descent process according to the smoothness, where the first threshold is increased if the smoothness is equal to or higher than a second threshold, and is reduced if the smoothness is lower than the second threshold.
 10. The method according to claim 1, wherein the gradient terms are adjusted by choosing one of permutations that minimizes the Euclidean distances or maximizes correlations of gradient terms between neighboring frequency bins.
 11. An apparatus for performing convolutive blind source separation, comprising: a first transformer which transforms each of a plurality of input signals into frequency domain; a calculator which calculates values of coefficients of unmixing filters corresponding to frequency bins by performing a gradient descent process on a cost function at least dependent on the coefficients of the unmixing filters, wherein in each iteration of the gradient descent process, gradient terms for calculating the values of the same coefficient of the unmixing filter are adjusted to improve smoothness of the gradient terms across the frequency bins; an estimator which, with respect to each of the frequency bins, estimates source signals by filtering the transformed input signals through the respective unmixing filter configured with the calculated values of the coefficients; and a second transformer which transforms the estimated source signals on the respective frequency bins into time domain, wherein the cost function is adapted to evaluate decorrelation between the estimated source signals.
 12. The apparatus according to claim 11, wherein the number of the plurality of input signals is two.
 13. The apparatus according to claim 12, wherein the calculator is configured to, with respect to each of the frequency bins, calculate the gradient terms for use in the current iteration according to one of the following methods: ∇_(w) ₁₂ =μ₁((X ₁ X ₁ *W ₂₁ *+W ₁₂ X ₂ X ₁ *W ₂₁ *+X ₁ X ₂ *+W ₁₂ X ₂ X ₂*)Y ₂ X ₂*), ∇_(w) ₂₁ =μ₂((W ₂₁ X ₁ X ₁ *+X ₂ X ₁ *+W ₂₁ X ₁ X ₂ *W ₁₂ *+X ₂ X ₂ *W ₁₂*)Y ₁ X ₁*); ∇_(w) ₁₂ =μ₁(Y ₁ Y ₂*(W ₂₁ X ₁ X ₂ *+X ₂ X ₂*)), ∇_(w) ₂₁ =μ₂(Y ₂ Y ₁*(X ₁ X ₁ *+W ₁₂ X ₂ X ₁*)); and ∇_(w) ₁₂ =μ₁((X ₁ +W ₁₂ X ₂)Y ₂*), ∇_(w) ₂₁ =μ₂((X ₂ +W ₂₁ X ₁)Y ₁*), where μ₁ and μ₂ are step size functions, ∇_(w) ₁₂ is the gradient term for calculating the value of the coefficient W₁₂, ∇_(w) ₂₁ is the gradient term for calculating the value of the coefficient W₂₁, X₁ and X₂ are the transformed input signals in the previous iteration respectively, Y₁ is the source signal estimated as X₁+W₁₂X₂ in the previous iteration, Y₂ is the source signal estimated as X₂+W₂₁X₁ in the previous iteration, and * represents complex conjugate.
 14. The apparatus according to claim 12, wherein the calculator is configured to, with respect to each of the frequency bins, calculate the gradient terms for use in the current iteration as ∇₁=μ₁ Y ₁ Y ₂*, ∇₂=μ₂ Y ₂ Y ₁*; where μ₁ and μ₂ are step size functions, ∇₁ is the gradient term for calculating the value of the coefficient W₁₂, ∇₂ is the gradient term for calculating the value of the coefficient W₂₁, Y₁ is the source signal estimated as X₁+W₁₂X₂ in the previous iteration, Y₂ is the source signal estimated as X₂+W₂₁X₁ in the previous iteration, and * represents complex conjugate.
 15. The apparatus according to claim 11, wherein the calculator is further configured to, with respect to each of the frequency bins, determine whether the unmixing filter is in a divergence condition or not, adopt the gradient terms calculated in the previous iteration as the gradient terms for use in the current iteration if the unmixing filter is in the divergence condition, and calculate the gradient terms for use in the current iteration if the unmixing filter is not in the divergence condition.
 16. The apparatus according to claim 11, wherein the calculator is configured to, with respect to each of the coefficients, transform the gradient terms over the frequency bins for calculating the coefficient into a time domain filter of length T, de-emphasize coefficients of the time domain filter at time indices exceeding a first threshold smaller than the length T, and transform coefficients of the time domain filter from time domain into frequency domain through a length-T transformation.
 17. The apparatus according to claim 16, wherein the de-emphasizing of the coefficients comprises zeroing the coefficients at time indices exceeding the first threshold, or reducing the coefficients at time indices exceeding the first threshold relative to coefficients of the time domain filter not at time indices exceeding the first threshold.
 18. The apparatus according to claim 16, wherein the calculator is further configured to adjust the first threshold in at least one iteration of the gradient descent process according to the proportion of the unmixing filters in a divergence condition, where the higher the proportion is, the smaller the first threshold is.
 19. The apparatus according to claim 16, wherein the calculator is further configured to adjust the first threshold in at least one iteration of the gradient descent process according to the smoothness, where the first threshold is increased if the smoothness is equal to or higher than a second threshold, and is reduced if the smoothness is lower than the second threshold.
 20. The apparatus according to claim 11, wherein the calculator is further configured to adjust the gradient terms by choosing one of permutations that minimizes the Euclidean distances or maximizes correlations of gradient terms between neighboring frequency bins.
 21. A computer-readable medium having computer program instructions recorded thereon, when being executed by a processor, the instructions enabling the processor to perform a method of convolutive blind source separation based on second order statistics comprising: transforming each of a plurality of input signals into frequency domain; calculating values of coefficients of unmixing filters corresponding to frequency bins by performing a gradient descent process on a cost function at least dependent on the coefficients of the unmixing filters, wherein in each iteration of the gradient descent process, gradient terms for calculating the values of the same coefficient of the unmixing filters are adjusted to improve smoothness of the gradient terms across the frequency bins; with respect to each of the frequency bins, estimating source signals by filtering the transformed input signals through the respective unmixing filter configured with the calculated values of the coefficients; and transforming the estimated source signals on the respective frequency bins into time domain, wherein the cost function is adapted to evaluate decorrelation between the estimated source signals. 